Top trading with fixed tie-breaking in markets with indivisible goods
نویسنده
چکیده
We study markets with indivisible goods where monetary compensations are not possible. Each individual is endowed with an object and a preference relation over all objects. When preferences are strict, Gale’s top trading cycle algorithm finds the unique core allocation. When preferences are not necessarily strict, we use an exogenous profile of tie-breakers to resolve any ties in individuals’ preferences and apply Gale’s top trading cycle algorithm for the resulting profile of strict preferences. We provide a foundation of these simple extensions of Gale’s top trading cycle algorithm from strict preferences to weak preferences. We show that Gale’s top trading cycle algorithm with fixed tie-breaking is characterized by individual rationality, strategy-proofness, weak efficiency, non-bossiness, and consistency. Our result supports the common practice in applications to break ties in weak preferences using some fixed exogenous criteria and then to use a “good and simple” rule for the resulting strict preferences. This reinforces the market-based approach even in the presence of indifferences because always competitive allocations are chosen. JEL Classification: C78, D63, D70
منابع مشابه
On the parameterized complexity of manipulating Top Trading Cycles
We study the problem of exchange when 1) agents are endowed with heterogeneous indivisible objects, and 2) there is no money. In general, no rule satisfies the three central properties Pareto-efficiency, individual rationality, and strategy-proofness [62]. Recently, it was shown that Top Trading Cycles is NP-hard to manipulate [32], a relaxation of strategy-proofness. However, parameterized com...
متن کاملExchange of indivisible goods and indifferences: The Top Trading Absorbing Sets mechanisms
There is a wide range of economic problems involving the exchange of indivisible goods without monetary transfers, starting from the housing market model of the seminal paper of Shapley and Scarf [10] and including other problems like the kidney exchange or the school choice problems. For many of these models, the classical solution is the application of an algorithm/mechanism called Top Tradin...
متن کاملA Complexity Approach for Core-Selecting Exchange with Multiple Indivisible Goods under Lexicographic Preferences
Core-selection is a crucial property of social choice functions, or rules, in social choice literature. It is also desirable to address the incentive of agents to cheat by misreporting their preferences. This paper investigates an exchange problem where each agent may have multiple indivisible goods, agents’ preferences over sets of goods are assumed to be lexicographic, and side payments are n...
متن کاملWhy do popular mechanisms lack e¢ ciency in random assignment problems?
We consider the problem of randomly assigning n indivisible objects to n agents. Recent research introduced a promising mechanism, the probabilistic serial that has superior e¢ ciency properties than the most common real-life mechanism random priroity. On the other hand, mechanisms based on Gales celebrated top trading cycles method have long dominated the indivisible goods literature (with th...
متن کاملWhy do popular mechanisms lack efficiency in random environments?
We consider the problem of randomly assigning n indivisible objects to n agents. Recent research introduced a promising mechanism, the probabilistic serial that has superior e¢ ciency properties than the most common real-life mechanism random priority. On the other hand, mechanisms based on Gales celebrated top trading cycles method have long dominated the indivisible goods literature (with th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Economic Theory
دوره 151 شماره
صفحات -
تاریخ انتشار 2014